An overview of Prolog debugging tools

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

B-Prolog: An Overview

B-Prolog is a high-performance, high-quality, and award-wining implementation of the standard Prolog language with several useful extended features including action rules for event handling, finite-domain constraint solving, and tabling. First released in 1994, B-Prolog has become one of the most innovative and widely used CLP systems. Whether it comes to standard Prolog programs, or finite-dom...

متن کامل

Debugging Prolog Using Annotations

We present an annotation language well-suited for rendering aspects of Prolog execution. Our annotations are special Prolog goals that act as executable comments, performing debugging at run-time. No restrictions are placed upon the object language , the concern being veriication of (full) Standard Prolog programs. Here we discuss the merits of the annotations for Prolog debugging. All the exam...

متن کامل

Debugging Prolog Programs Declaratively

Traditional declarative debuggers, despite their theoretical attractions are not considered to be practical tools for debugging of many Prolog programs. This is partly due to the fact that the basic declarative debugging system (Shapiro 83) only dealt with pure Prolog programs, and partly due to practical limitations of the suggested methods and algorithms. Our aim has been to study the applica...

متن کامل

Debugging Prolog Using Annotations

We propose an annotation language well suited for rendering aspects of Prolog execution. Our annotations are special Prolog goals that act as executable comments, performing debugging at run-time. We do not place any restrictions upon the object language, the concern being verification of (full) Standard Prolog programs. Ample illustrations of the merits of the approach are given. All examples ...

متن کامل

An Overview of Lambda-PROLOG

λ-Prolog is a logic programming language that extends Prolog by incorporating notions of higher-order functions, λ-terms, higher-order unification, polymorphic types, and mechanisms for building modules and secure abstract data types. These new features are provided in a principled fashion by extending the classical first-order theory of Horn clauses to the intuitionistic higher-order theory of...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Instructional Science

سال: 1991

ISSN: 0020-4277,1573-1952

DOI: 10.1007/bf00120882